CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

两种捆绑火箭弹性振动建模方法对比分析及其对姿控系统的影响

针对长助推和短助推两种类型捆绑火箭的不同模态特点,分析了两者弹性振动建模方法的区别和联系,在此基础上建立了某型固体捆绑火箭姿态动力学新模型,模型中基于有限元法导出了弹性振动方程,基于该模型对箭体复杂弹性振动引起的通道间耦合进行了研究,采用逆Nyquist阵列法进行设计。结果表明,该模型能更准确地反映捆绑火箭纵、横、扭耦合运动特性;新模型三通道之间存在弹性耦合,但耦合矩阵具有对角优势性质,采用逆Nyquist阵列法进行姿控系统设计是有效的,仿真结果表明设计的控制器可行,能够取得比较好的性能。     

The effectiveness of the longest delivery time rule for the flow shop delivery time problem

In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Capacity investment decisions under risk aversion

This article studies the optimal capacity investment problem for a risk‐averse decision maker. The capacity can be either purchased or salvaged, whereas both involve a fixed cost and a proportional cost/revenue. We incorporate risk preference and use a consumption model to capture the decision maker's risk sensitivity in a multiperiod capacity investment model. We show that, in each period, capacity and consumption decisions can be separately determined. In addition, we characterize the structure of the optimal capacity strategy. When the parameters are stationary, we present certain conditions under which the optimal capacity strategy could be easily characterized by a static two‐sided (s, S) policy, whereby, the capacity is determined only at the beginning of period one, and held constant during the entire planning horizon. It is purchased up to B when the initial capacity is below b, salvaged down to Σ when it is above σ, and remains constant otherwise. Numerical tests are presented to investigate the impact of demand volatility on the optimal capacity strategy. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 218–235, 2016     

双材料V型切口应力强度因子的加料有限元分析

应用Williams本征函数展开和线性变换求解V型切口端部渐进位移场。将该位移场加入常规等参单元位移模式中,构造双材料V型切口加料单元和过渡单元的位移模式,推导加料有限元方程。建立带V型缺口双材料三点弯曲梁试件和直角界面端平面问题的加料有限元模型,求解有限元方程可直接得到应力强度因子。计算结果与用其他方法得到的数据吻合,验证了方法的正确性,可用于双材料V型切口结构断裂特性计算分析。     

基于复合左右手传输线90°移相器的设计

复合左右手传输线的提出在无线通讯领域将有很大的应用前景,也为微波传输线和微波元件的设计提供了一种新思路.根据复合左右手传输线的相位特性及频带展宽原理设计了一个90°移相器,该移相器理论上可以实现L波段从f_1到f_2的90°移相.相对带宽为31%,工作频带内的绝对误差在±3°以内.仿真结果表明,基于复合左右手传输线的90°移相器能够实现宽带内的移相,且效果比较明显.实际电路也比较吻合仿真电路,达到理想的要求.     

基于“综合赋权”模糊物元模型的机场运行安全评价

为了保证机场运行安全,防止事故的发生,依据模糊物元分析理论,结合机场运行安全评价指标体系,构建了基于综合赋权的机场系统模糊物元安全评价模型。在该模型中,通过层次分析法和熵值法主客观综合所确定的权重,为指标体系进行线性加权,实现综合赋权,从而将计算得到的综合权重用于模糊物元建模与评价。实例分析结果表明,该模型步骤简单,过程科学合理,并兼顾了主客观因素的影响,评价结果总体反映了机场的真实安全水平,也为机场安全的科学评价提供了新思路。     

基于模糊物元分析法的坦克作战效能评估

鉴于坦克作战效能评估中客观存在的不确定性和模糊性,提出了基于改进模糊物元分析方法的坦克作战效能评估模型。该模型在构建坦克作战效能评估指标体系基础上,将层次分析法和熵权法计算出的权重有机组合实现综合赋权,并据此建立坦克作战效能的模糊物元分析评估模型。实例分析表明,所提出的模型便于理解,易于实现,兼顾了主客观因素的影响,评估结果总体反映了坦克作战效能的真实水平,也为其他装甲武器作战效能的科学评估提供新思路。     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017     

可折叠的带状Blumlein线的研究

为了实现脉冲形成线的小型化,从基本原理入手,提出了一种带状Blumlein线的折叠设计思路,并给出了相应的工作参量和几何尺寸及制作工艺要求。